The Zagreb indices of graphs with a given clique number
نویسندگان
چکیده
منابع مشابه
Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
In this paper, we present sharp bounds for the Zagreb indices, Harary index and hyperWiener index of graphs with a given matching number, and we also completely determine the extremal graphs. © 2010 Elsevier Ltd. All rights reserved.
متن کاملExtremal Zagreb Indices of Graphs with a Given Number of Cut Edges
For a graph, the first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. Denote by Gn,k the set of graphs with n vertices and k cut edges. In this paper, we showed the types of graphs with the largest and the second largest M1 and M2 among Gn,k .
متن کاملSharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
For a (molecular) graph, the first Zagreb index M1 is equal to the sum of squares of the vertex degrees, and the second Zagreb index M2 is equal to the sum of products of degrees of pairs of adjacent vertices. In this paper, we investigate Zagreb indices of bicyclic graphs with a given matching number. Sharp upper bounds for the first and second Zagreb indices of bicyclic graphs in terms of the...
متن کاملOn the Spectral Moment of Graphs with given Clique Number
Let Ln,t be the set of all n-vertex connected graphs with clique number t (2 ≤ t ≤ n). For nvertex connected graphs with given clique number, lexicographic ordering by spectral moments (S-order) is discussed in this paper. The first ∑⌊(n−t−1)/3⌋ i=1 (n − t − 3i) + 1 graphs with 3 ≤ t ≤ n − 4, and the last few graphs, in the Sorder, among Ln,t are characterized. In addition, all graphs in Ln,n ∪...
متن کاملOn leap Zagreb indices of graphs
The first and second Zagreb indices of a graph are equal, respectively, to the sum of squares of the vertex degrees, and the sum of the products of the degrees of pairs of adjacent vertices. We now consider analogous graph invariants, based on the second degrees of vertices (number of their second neighbors), called leap Zagreb indices. A number of their basic properties is established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2011
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.01.034